/**
 * 
 */
package com.planner.core.algorithm.dijkstra.model;

import java.util.List;

import com.planner.core.vo.GraphNode;

/**
 * @author Sangharsh
 *
 */
public class Graph {
	private final List<GraphNode> vertexes;
	private final List<Edge> edges;

	public Graph(List<GraphNode> vertexes, List<Edge> edges) {
		this.vertexes = vertexes;
		this.edges = edges;
	}

	public List<GraphNode> getVertexes() {
		return vertexes;
	}

	public List<Edge> getEdges() {
		return edges;
	}
}

